Proceedings of the 4th ACM Workshop on Information Credibility on the Web

International Conference on Asian Language Processing

Investigating Characteristics of Non%2Dclick Behavior Using Query Logs.

Query Recommendation Considering Search Performance of Related Queries.

Investigating Characteristics of Non%2Dclick Behavior Using Query Logs.

Mapping Multicast Service%2DOriented Virtual Networks with Delay and Delay Variation Constraints.

Archival Utilization Service Based on Knowledge Management.

A CUSUM Chart for Monitoring an Attribute Event.

Specification Translation of State Machines from Equational Theories into Rewrite Theories.

Traffic flow forecasting based on rough set and neural network.

Penalty policies in professional software development practice a multi%2Dmethod field study.

Botnet Traffic Discriminatory Analysis Using Particle Swarm Optimization.

Sales Forecasting Based on ERP System through BP Neural Networks.

Understanding and Preparing for DNS Evolution.

Comparison of Lane Changing Algorithms between NGSIM and CORSIM.

Fine%2DGrained Cloud DB Damage Examination Based on Bloom Filters.

Study language models with specific user goals.

Hierarchical feature selection for ranking.

Are search engine users equally reliable%3F

Viewing cancer genes from co%2Devolving gene modules.

Linguistically Annotated Reordering Evaluation and Analysis.
Linguistic knowledge plays an important role on phrase movement in statistical machine translation. To efficiently incorporate linguistic knowledge into phrase reordering, we propose a new approach: Linguistically Annotated Reordering (LAR). In LAR, we build hard hierarchical skeletons and inject soft linguistic knowledge from source parse trees to nodes of hard skeletons during translation. The experimental results on large-scale training data show that LAR is comparable with boundary word based reordering (BWR) (Xiong, Liu, and Lin 2006) which is a very competitive lexicalized reordering approach. When combined with BWR, LAR provides complementary information for phrase reordering, which collectively improves the BLEU score significantly. To further understand the contribution of linguistic knowledge in LAR to phrase reordering, we introduce a syntax-based analysis method to automatically detect constituent movement in both reference and system translations, and summarize syntactic reordering patterns that are captured by reordering models. With the proposed analysis method, we conduct a comparative analysis that not only provides the insight into how linguistic knowledge affects phrase movement but also reveals new challenges in phrase reordering. 1.
Linguistically Annotated Reordering Evaluation and Analysis.
Linguistic knowledge plays an important role on phrase movement in statistical machine translation. To efficiently incorporate linguistic knowledge into phrase reordering, we propose a new approach: Linguistically Annotated Reordering (LAR). In LAR, we build hard hierarchical skeletons and inject soft linguistic knowledge from source parse trees to nodes of hard skeletons during translation. The experimental results on large-scale training data show that LAR is comparable with boundary word based reordering (BWR) (Xiong, Liu, and Lin 2006) which is a very competitive lexicalized reordering approach. When combined with BWR, LAR provides complementary information for phrase reordering, which collectively improves the BLEU score significantly. To further understand the contribution of linguistic knowledge in LAR to phrase reordering, we introduce a syntax-based analysis method to automatically detect constituent movement in both reference and system translations, and summarize syntactic reordering patterns that are captured by reordering models. With the proposed analysis method, we conduct a comparative analysis that not only provides the insight into how linguistic knowledge affects phrase movement but also reveals new challenges in phrase reordering. 1.
2009 International Conference on Asian Language Processing

Performance Analysis of Cognitive Radio Networks against Secondary User%27s Policies.

Automatic Extraction for Product Feature Words from Comments on the Web.

Automatic Search Engine Performance Evaluation with the Wisdom of Crowds.

Automatic Search Engine Performance Evaluation with the Wisdom of Crowds.

Web Spam Identification with User Browsing Graph.

Study on the Click Context of Web Search Users for Reliability Analysis.

Quantification Model for Estimating Temperature Field Distributions of Apple Fruit.

A Real%2Dtime Detecting and Tracking Method for Moving Objects Based on Color Video.

Exploring relevance for clicks.

USB in the Application of PCR Instrument Embedded System.

A Multi%2Dobjective Optimization Evolutionary Algorithm Addressing Diversity Maintenance.

Feature%2DBased Method for Document Alignment in Comparable News Corpora.

Fast Translation Rule Matching for Syntax%2Dbased Statistical Machine Translation.
In a linguistically-motivated syntax-based translation system, the entire translation process is normally carried out in two steps, translation rule matching and target sentence decoding using the matched rules. Both steps are very timeconsuming due to the tremendous number of translation rules, the exhaustive search in translation rule matching and the complex nature of the translation task itself. In this paper, we propose a hyper-tree-based fast algorithm for translation rule matching. Experimental results on the NIST MT-2003 Chinese-English translation task show that our algorithm is at least 19 times faster in rule matching and is able to help to save 57 % of overall translation time over previous methods when using large fragment translation rules. 1
K%2DBest Combination of Syntactic Parsers.
In this paper, we propose a linear model-based general framework to combine k-best parse outputs from multiple parsers. The proposed framework leverages on the strengths of previous system combination and re-ranking techniques in parsing by integrating them into a linear model. As a result, it is able to fully utilize both the logarithm of the probability of each k-best parse tree from each individual parser and any additional useful features. For feature weight tuning, we compare the simulated-annealing algorithm and the perceptron algorithm. Our experiments are carried out on both the Chinese and English Penn Treebank syntactic parsing task by combining two stateof-the-art parsing models, a head-driven lexicalized model and a latent-annotation-based un-lexicalized model. Experimental results show that our F-Scores of 85.45 on Chinese and 92.62 on English outperform the previously best-reported systems by 1.21 and 0.52, respectively. 1
Tree Kernel%2Dbased SVM with Structured Syntactic Knowledge for BTG%2Dbased Phrase Reordering.

Fitting a workflow model to captured development data.


A New Filtering Algorithm for Removing Salt%2Dand%2DPepper Noise.


Semi%2Dsupervised Learning of Domain%2DSpecific Language Models from General Domain Data.

Matched Rotation Precoding A New Paradigm in Space%2DFrequency Coding.

Optimization of Supply Chain Design Based on Knowledge Discovery of Distribution Network.

A Class of Model and Computational Intelligence in Supply Chain Network Design Considering Retailer Satisfaction.

Modular Implementation of a Translator from Behavioral Specifications to Rewrite Theory Specifications.

Average Transitive Trustworthy Degrees for Trustworthy Networks.

Analysis of UDP Traffic Usage on Internet Backbone Links.

Generalized Koebe%27s method for conformal mapping multiply connected domains.

Parameterized Bisimulation Infinite Evolution Mechanism.

User Browsing Graph Structure%2C Evolution and Application.

Web Observation from a User Perspective.

Max%2DMinimum Algorithm for Trust Transitivity in Trustworthy Networks.

Two%2DStage Hypotheses Generation for Spoken Language Translation.

Edge%2Dbased scoring and searching method for identifying condition%2Dresponsive protein%2Dprotein interaction sub%2Dnetwork.

Evaluating reproducibility of differential expression discoveries in microarray studies by considering correlated molecular changes.

Bi%2Dlevel programming model and hybrid genetic algorithm for flow interception problem with customer choice.

Topological Construction of Parameterized Bisimulation Limit.

Facility placement with sub%2Daisle design in an existing layout.

Calibration of Neurotransmitter Release from Neural Cells for Therapeutic implants.

Modeling of Workflow Congestion and Optimization of Flow Routing in a Manufacturing%2FWarehouse Facility.

A Tree Sequence Alignment%2Dbased Tree%2Dto%2DTree Translation Model.
This paper presents a translation model that is based on tree sequence alignment, where a tree sequence refers to a single sequence of subtrees that covers a phrase. The model leverages on the strengths of both phrase-based and linguistically syntax-based method. It automatically learns aligned tree sequence pairs with mapping probabilities from word-aligned biparsed parallel texts. Compared with previous models, it not only captures non-syntactic phrases and discontinuous phrases with linguistically structured features, but also supports multi-level structure reordering of tree typology with larger span. This gives our model stronger expressive power than other reported models. Experimental results on the NIST MT-2005 Chinese-English translation task show that our method statistically significantly outperforms the baseline systems. 1
A Linguistically Annotated Reordering Model for BTG%2Dbased Statistical Machine Translation.

Exploiting N%2Dbest Hypotheses for SMT Self%2DEnhancement.
Word and n-gram posterior probabilities estimated on N-best hypotheses have been used to improve the performance of statistical machine translation (SMT) in a rescoring framework. In this paper, we extend the idea to estimate the posterior probabilities on N-best hypotheses for translation phrase-pairs, target language n-grams, and source word reorderings. The SMT system is self-enhanced with the posterior knowledge learned from N-best hypotheses in a re-decoding framework. Experiments on NIST Chinese-to-English task show performance improvements for all the strategies. Moreover, the combination of the three strategies achieves further improvements and outperforms the baseline by 0.67 BLEU score on NIST-2003 set, and 0.64 on NIST-2005 set, respectively.
News Page Discovery Policy for Instant Crawlers.

Identifying web spam with user behavior analysis.

Disease Prediction Power and Stability of Differential Expressed Genes.

Research and Exploit on PCR Apparatus.

Simulation of Multivariate Spatial%2DTemporal Outbreak Data for Detection Algorithm Evaluation.

Automatic online news topic ranking using media focus and user attention based on aging theory.


Linguistically Annotated BTG for Statistical Machine Translation.
Bracketing Transduction Grammar (BTG) is a natural choice for effective integration of desired linguistic knowledge into statistical machine translation (SMT). In this paper, we propose a Linguistically Annotated BTG (LABTG) for SMT. It conveys linguistic knowledge of source-side syntax structures to BTG hierarchical structures through linguistic annotation. From the linguistically annotated data, we learn annotated BTG rules and train linguistically motivated phrase translation model and reordering model. We also present an annotation algorithm that captures syntactic information for BTG nodes. The experiments show that the LABTG approach significantly outperforms a baseline BTGbased system and a state-of-the-art phrasebased system on the NIST MT-05 Chineseto-English translation task. Moreover, we empirically demonstrate that the proposed method achieves better translation selection and phrase reordering. 1
Regenerating Hypotheses for Statistical Machine Translation.


Spectral methods for semi%2Dsupervised manifold learning.
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data points, we need to determine the parameter vectors for the rest of the data points. This problem is known as semi-supervised manifold learning, and in this paper we propose methods to handle this problem by solving certain eigenvalue-problems. Our proposed methods address two key issues in semi-supervised manifold learning: 1) fitting of the local affine geometric structures, and 2) preserving the global manifold structures embodied in the overlapping neighborhoods around each data points. We augment the alignment matrix of local tangent space alignment (LTSA) with the orthogonal projection based on the known parameter vectors, giving rise to the eigenvalue problem that characterizes the semi-supervised manifold learning problem. We also discuss the roles of different types of neighborhoods and their influence on the learning process. We illustrate the performance of the proposed methods using both synthetic data sets as well as data sets arising from applications in video annotations. 1.
Do bad smells indicate %22trouble%22 in code%3F
We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexicosyntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested. 1 Introduction  Currently there is much interest in the automatic acquisition of lexical syntax and semantics, with the goal of building up large lexicons for natural language processing. Projects ...
Multirate Space%2DTime%2DFrequency Linear block coding.
Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained
Nonlinear multi%2Dscale contrast enhancement for chest radiograph.

A psychovisual image Quality Metric based on multi%2Dscale Structure Similarity.

The self%2Dadaption strategy for parameter epsilon in epsilon%2DMOEA.

Improved Algorithm for Tate Pairing Computation.

Low%2DCost VC Allocator Design for Virtual Channel Wormhole Routers in Networks%2Don%2DChip.

A generation model to unify topic relevance and lexicon%2Dbased sentiment for opinion retrieval.

A Bigraphical Model of WSBPEL.

THUIR at TREC 2008 Blog Track.

THUIR at TREC 2008 Enterprise Track.

THUIR at TREC 2008 Relevance Feedback Track.



User behavior oriented web spam detection.

Using a Hybrid Convolution Tree Kernel for Semantic Role Labeling.
As a kind of Shallow Semantic Parsing, more attention is being paid to Semantic Role Labeling (SRL) as it benefits a wide range of natural language processing applications. Given a sentence, the task of SRL is to recognize semantic arguments (roles) for each predicate (target verb or noun). Feature-based methods have achieved much success in SRL and are regarded as the state-of-the-art methods for SRL. However, these methods are less effective in modeling structured features, e.g. the very useful Path feature for SRL. As an extension of feature-based methods, kernel-based methods are able to capture structured features more efficiently in a much higher dimension. Application of kernel methods to SRL has been achieved by selecting the tree portion of a predicate and one of its arguments as feature space, which is named as predicate-argument feature (PAF) kernel. The PAF kernel captures the syntactic tree structure features using convolution tree kernel, however, it does not distinguish the path structure and the constituent structure. In this paper, a hybrid convolution tree kernel is proposed to model different linguistic objects. The hybrid convolution tree kernel consists of two individual convolution tree kernels. a Path kernel, which captures predicate-argument link features, and a Constituent Structure kernel, which captures the syntactic structure features of arguments. Evaluations on the data sets of the CoNLL-2005 SRL shared task and the Chinese PropBank (CPB) show that our proposed hybrid convolution tree kernel statistically significantly outperforms the previous tree kernels. Moreover, in order to maximize the system performance, we present a composite kernel through combining our hybrid convolution tree kernel method with a feature-based method extended by the polynomial kernel. The experimental results show that the composite kernel achieves better performance than each of the individual methods and outperforms the best reported system on the CoNLL-2005 corpus when using only one syntactic parser and on the CPB corpus when using correct syntactic parse results respectively.
Automatic online news issue construction in web environment.

An Automatic Online News Topic Keyphrase Extraction System.

Web Image Clustering Based on Multi%2Dinstance.

Using a Hybrid Convolution Tree Kernel for Semantic Role Labeling.
As a kind of Shallow Semantic Parsing, more attention is being paid to Semantic Role Labeling (SRL) as it benefits a wide range of natural language processing applications. Given a sentence, the task of SRL is to recognize semantic arguments (roles) for each predicate (target verb or noun). Feature-based methods have achieved much success in SRL and are regarded as the state-of-the-art methods for SRL. However, these methods are less effective in modeling structured features, e.g. the very useful Path feature for SRL. As an extension of feature-based methods, kernel-based methods are able to capture structured features more efficiently in a much higher dimension. Application of kernel methods to SRL has been achieved by selecting the tree portion of a predicate and one of its arguments as feature space, which is named as predicate-argument feature (PAF) kernel. The PAF kernel captures the syntactic tree structure features using convolution tree kernel, however, it does not distinguish the path structure and the constituent structure. In this paper, a hybrid convolution tree kernel is proposed to model different linguistic objects. The hybrid convolution tree kernel consists of two individual convolution tree kernels. a Path kernel, which captures predicate-argument link features, and a Constituent Structure kernel, which captures the syntactic structure features of arguments. Evaluations on the data sets of the CoNLL-2005 SRL shared task and the Chinese PropBank (CPB) show that our proposed hybrid convolution tree kernel statistically significantly outperforms the previous tree kernels. Moreover, in order to maximize the system performance, we present a composite kernel through combining our hybrid convolution tree kernel method with a feature-based method extended by the polynomial kernel. The experimental results show that the composite kernel achieves better performance than each of the individual methods and outperforms the best reported system on the CoNLL-2005 corpus when using only one syntactic parser and on the CPB corpus when using correct syntactic parse results respectively.
Variable selection for large p small n regression models with incomplete data Mapping QTL with epistases.

Apparently low reproducibility of true differential expression discoveries in microarray studies.

Gaining confidence in biological interpretation of the microarray data the functional consistence of the significant GO categories.

Semantic Role Labeling Using a Grammar%2DDriven Convolution Tree Kernel.
Abstract—Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only performs hard matching between sub-trees. To overcome these constraints, this paper proposes a grammar-driven convolution tree kernel for SRL by introducing more linguistic knowledge. Compared with the standard convolution tree kernel, the proposed grammar-driven kernel has two advantages: 1) grammardriven approximate substructure matching, and 2) grammardriven approximate tree node matching. The two approximate matching mechanisms enable the proposed kernel to better explore linguistically motivated structured knowledge. Experiments on the CoNLL-2005 SRL shared task and the PropBank I corpus show that the proposed kernel outperforms the standard convolution tree kernel significantly. Moreover, we present a composite kernel to integrate a feature-based polynomial kernel and the proposed grammar-driven convolution tree kernel for SRL. Experimental results show that our composite kernel-based method significantly outperforms the previously best-reported ones.
Exploring syntactic structured features over parse trees for relation extraction using kernel methods.

Hierarchical learning strategy in semantic relation extraction.

Differential evolution with dynamic stochastic selection for constrained optimization.

Efficient approach and application of the Green%27s functions in spatial domain in multilayered media.

Computational self%2Dassembly.
Self-assembly is a process that creates complex hierarchical structures through the statistical exploration of alternative configurations. These processes occur without external intervention. The specific system that is self-assembled (from a given set of components) is determined by the way the statistical exploration of conformations is performed. In turn, the exploration mechanisms are constrained by the individual components that undergo self-assembly and the conditions imposed upon them by their local environment. Usually these constraints are related to the type of interactions in which the components engage. In general, components are autonomous, have no preprogrammed master assembly plan, and can only interact with their local environment and other components. Self-assembly is a powerful autopoietic mechanism whose power, as a reusable engineering concept, lays in the fact that it is distributed, nonnecessarily synchronous, control mechanism for the bottom-up manufacture of complex systems. The control mechanism is distributed across a myriad of elemental components, none of which has either the storage or the computation capabilities to know and follow a master plan for the assembly of the intended system. Instead each component
A Grammar%2Ddriven Convolution Tree Kernel for Semantic Role Classification.
Convolution tree kernel has shown promising results in semantic role classification. However, it only carries out hard matching, which may lead to over-fitting and less accurate similarity measure. To remove the constraint, this paper proposes a grammardriven convolution tree kernel for semantic role classification by introducing more linguistic knowledge into the standard tree kernel. The proposed grammar-driven tree kernel displays two advantages over the previous one: 1) grammar-driven approximate substructure matching and 2) grammardriven approximate tree node matching. The two improvements enable the grammardriven tree kernel explore more linguistically motivated structure features than the previous one. Experiments on the CoNLL-2005 SRL shared task show that the grammardriven tree kernel significantly outperforms the previous non-grammar-driven one in SRL. Moreover, we present a composite kernel to integrate feature-based and tree kernel-based methods. Experimental results show that the composite kernel outperforms the previously best-reported methods. 1
A CDD%2Dbased formal model for expert finding.

Tree Kernel%2DBased Relation Extraction with Context%2DSensitive Structured Parse Tree Information.
This paper proposes a tree kernel with contextsensitive structured parse tree information for relation extraction. It resolves two critical problems in previous tree kernels for relation extraction in two ways. First, it automatically determines a dynamic context-sensitive tree span for relation extraction by extending the widely-used Shortest Path-enclosed Tree (SPT) to include necessary context information outside SPT. Second, it proposes a context-sensitive convolution tree kernel, which enumerates both context-free and contextsensitive sub-trees by considering their ancestor node paths as their contexts. Moreover, this paper evaluates the complementary nature between our tree kernel and a state-of-the-art linear kernel. Evaluation on the ACE RDC corpora shows that our dynamic context-sensitive tree span is much more suitable for relation extraction than SPT and our tree kernel outperforms the state-of-the-art Collins and Duffy’s convolution tree kernel. It also shows that our tree kernel achieves much better performance than the state-of-the-art linear kernels. Finally, it shows that feature-based and tree kernel-based methods much complement each other and the composite kernel can well integrate both flat and structured features. 1
Performance Comparison of Software Complexity Metrics in an Open Source Project.

Chance Constrained Bi%2Dlevel Programming Approach for Flow Interception Problem with Stochastic Users in Fuzzy Environment.

The Study on the Architecture of Public knowledge Service Platform Based on Collaborative Innovation.

A New Method Of Processing Blog Posts For Sentiment Classification.

THUIR at TREC 2007 Enterprise Track.

Automatic search engine performance evaluation with click%2Dthrough data analysis.
Performance evaluation is an important issue in Web search engine researches. Traditional evaluation methods rely on much human efforts and are therefore quite time-consuming. With clickthrough data analysis, we proposed an automatic search engine performance evaluation method. This method generates navigational type query topics and answers automatically based on search users ’ querying and clicking behavior. Experimental results based on a commercial Chinese search engine’s user logs show that the automatically method gets a similar evaluation result with traditional assessor-based ones.
Finding Experts Using Social Network Analysis.

Edge%2Dbased scoring and searching method for identifying condition%2Dresponsive protein%2Dprotein interaction sub%2Dnetwork.

An Extended One%2DRing MIMO Channel Model.

Extracting relation information from text documents by exploring various types of knowledge.

Building a Collocation Net.

Data cleansing for Web information retrieval using query independent features.

Computer Processing of Oriental Languages. Beyond the Orient The Research Challenges Ahead

A Composite Kernel to Extract Relations between Entities with Both Flat and Structured Features.
This paper proposes a novel composite kernel for relation extraction. The composite kernel consists of two individual kernels: an entity kernel that allows for entity-related features and a convolution parse tree kernel that models syntactic information of relation examples. The motivation of our method is to fully utilize the nice properties of kernel methods to explore diverse knowledge for relation extraction. Our study illustrates that the composite kernel can effectively capture both flat and structured features without the need for extensive feature engineering, and can also easily scale to include more features. Evaluation on the ACE corpus shows that our method outperforms the previous best-reported methods and significantly outperforms previous two dependency tree kernels for relation extraction. 1
A Hybrid Convolution Tree Kernel for Semantic Role Labeling.
A hybrid convolution tree kernel is proposed in this paper to effectively model syntactic structures for semantic role labeling (SRL). The hybrid kernel consists of two individual convolution kernels: a Path kernel, which captures predicateargument link features, and a Constituent Structure kernel, which captures the syntactic structure features of arguments. Evaluation on the datasets of CoNLL-2005 SRL shared task shows that the novel hybrid convolution tree kernel outperforms the previous tree kernels. We also combine our new hybrid tree kernel based method with the standard rich flat feature based method. The experimental results show that the combinational method can get better performance than each of them individually. 1
A Phrase%2DBased Statistical Model for SMS Text Normalization.

Modeling Commonality among Related Classes in Relation Extraction.
This paper proposes a novel hierarchical learning strategy to deal with the data sparseness problem in relation extraction by modeling the commonality among related classes. For each class in the hierarchy either manually predefined or automatically clustered, a linear discriminative function is determined in a topdown way using a perceptron algorithm with the lower-level weight vector derived from the upper-level weight vector. As the upper-level class normally has much more positive training examples than the lower-level class, the corresponding linear discriminative function can be determined more reliably. The upperlevel discriminative function then can effectively guide the discriminative function learning in the lower-level, which otherwise might suffer from limited training data. Evaluation on the ACE RDC 2003 corpus shows that the hierarchical strategy much improves the performance by 5.6 and 5.1 in F-measure on least- and medium- frequent relations respectively. It also shows that our system outperforms the previous best-reported system by 2.7 in F-measure on the 24 subtypes using the same feature set. 1
A PDD%2DBased Searching Approach for Expert Finding in Intranet Information Management.

Automatic Query Type Identification Based on Click Through Information.


Hierarchical Learning Strategy in Relation Extraction Using Support Vector Machines.


A Hybrid Approach to Chinese Abbreviation Expansion.

Building a Collocation Net.

Secrecy of Signals by Typing in Signal Transduction.

A Unified Framework for Text Analysis in Chinese TTS.

A Hybrid of Differential Evolution and Genetic Algorithm for Constrained Multiobjective Optimization Problems.

Infeasible Elitists and Stochastic Ranking Selection in Constrained Evolutionary Multi%2Dobjective Optimization.

Polarized MIMO channels in 3%2DD models%2C measurements and mutual information.
G systems are expected to support data rates of the order of 100 Mbps in the outdoor environment and 1 Gbps  in the indoor/stationary environment. In order to support such large payloads, the radio physical layer must employ  receiver algorithms that provide a significant increase in spectrum efficiency (and hence capacity) over current  wireless systems. Recently an explosion of MIMO studies have appeared with many journals presenting special  issues on this subject. This has occured due to the potential of MIMO to provide a linear increase in capacity with  antenna numbers. Environmental considerations and tower loads will often restrict the placing of large antenna  spans on base stations. Similarly, customer device form factors also place a limit on the antenna numbers that can  be placed with a mutual spacing of 0.5 wavelength. The use of cross-polarized antennas is widely used in modern  cellular installations as it reduces spacing needs and tower loads on base stations. Hence, this approach is also  receiving considerable attention in MIMO systems. In order to study and compare various receiver architectures  that are based on MIMO techniques, one needs to have an accurate knowledge of the MIMO channel. However,  very few studies have appeared that characterize the cross-polarized MIMO channel. Recently, the third generation  partnership standards bodies (3GPP/3GPP2) have defined a cross-polarized channel model for MIMO systems but  this model neglects the elevation spectrum. In this paper we provide a deeper understanding of the channel model  for cross-polarized systems for different environments and propose a composite channel impulse model for the  cross-polarized channel that takes into account both azimuth and elevation spectrum. We use the resulting chann...
The nature of novelty detection.
Sentence level novelty detection aims at spotting sentences with novel information from an ordered sentence list. In the task, sentences appearing later in the list with no new meanings are eliminated. For the task of novelty detection, the contributions of this paper are three-fold. First, conceptually, this paper reveals the computational nature of the task currently overlooked by the Novelty community − Novelty as a combination of partial overlap (PO) and complete overlap (CO) relations between sentences. We define partial overlap between two sentences as a sharing of common facts, while complete overlap is when one sentence covers all of the meanings of the other sentence. Second, technically, a novel approach, the selected pool method is provided which follows naturally from the PO-CO computational structure. We provide formal error analysis for selected pool and methods based on this PO-CO framework. We address the question how accurate must the PO judgments be to outperform the baseline pool method. Third, experimentally, results were presented for all the three novelty datasets currently available. Results show that the selected pool is significantly better or no worse than the current methods, an indication that the term overlap criterion for the PO judgments could be adequately accurate.
Exploring Various Knowledge in Relation Extraction.
Extracting semantic relationships between entities is challenging. This paper investigates the incorporation of diverse lexical, syntactic and semantic knowledge in feature-based relation extraction using SVM. Our study illustrates that the base phrase chunking information is very effective for relation extraction and contributes to most of the performance improvement from syntactic aspect while additional information from full parsing gives limited further enhancement. This suggests that most of useful information in full parse trees for relation extraction is shallow and can be captured by chunking. We also demonstrate how semantic information such as WordNet and Name List, can be used in feature-based relation extraction to further improve the performance. Evaluation on the ACE corpus shows that effective incorporation of diverse features enables our system outperform previously best-reported systems on the 24 ACE relation subtypes and significantly outperforms tree kernel-based systems by over 20 in F-measure on the 5 ACE relation types. 1
The Empirical Impact of the Nature of Novelty Detection.
Sentence level novelty detection aims at spotting sentences with novel information from an ordered sentence list. In the task, sentences appearing later in the list with no new meanings are eliminated. For the task of novelty detection, the contributions of this paper are three-fold. First, conceptually, this paper reveals the computational nature of the task currently overlooked by the Novelty community − Novelty as a combination of partial overlap (PO) and complete overlap (CO) relations between sentences. We define partial overlap between two sentences as a sharing of common facts, while complete overlap is when one sentence covers all of the meanings of the other sentence. Second, technically, a novel approach, the selected pool method is provided which follows naturally from the PO-CO computational structure. We provide formal error analysis for selected pool and methods based on this PO-CO framework. We address the question how accurate must the PO judgments be to outperform the baseline pool method. Third, experimentally, results were presented for all the three novelty datasets currently available. Results show that the selected pool is significantly better or no worse than the current methods, an indication that the term overlap criterion for the PO judgments could be adequately accurate.
Topic%2DIndependent Web High%2DQuality Page Selection Based on K%2DMeans Clustering.

Superparamagnetic Particle Embedded Microprobe %28SPEM%29 for GMR Sensor Sensitivity Calibration.

Efficient Time Series Matching Based on HMTS Algorithm.

Typing Aberrance in Signal Transduction.

Discovering Relations Between Named Entities from a Large Raw Corpus Using Tree Similarity%2DBased Clustering.


Phrase%2DBased Statistical Machine Translation A Level of Detail Approach.

A Phrase%2DBased Context%2DDependent Joint Probability Model for Named Entity Translation.
Abstract. We propose a phrase-based context-dependent joint probability model for Named Entity (NE) translation. Our proposed model consists of a lexical mapping model and a permutation model. Target phrases are generated by the context-dependent lexical mapping model, and word reordering is performed by the permutation model at the phrase level. We also present a twostep search to decode the best result from the models. Our proposed model is evaluated on the LDC Chinese-English NE translation corpus. The experiment results show that our proposed model is high effective for NE translation. 1.
Substream Selection in Wireless MIMO Systems for Complexity Reduction.

An Efficient Wireless Resource Allocation Based on a Data Compressor Predictor.

THUIR at TREC 2005 Terabyte Track.
Abstract: IR group of Tsinghua University this year has used its TMiner text retrieval system for indexing and retrieval of the Terabyte track ad hoc and named-page subtasks. In doing the two tasks, we used the in-link anchor texts (the anchor of the URLs that point to the current page in the collection) together with the content texts of the web pages for building the indices. When retrieving, the word-pair method [1] was used and proved effective on 2004 and 2005 Terabyte ad hoc task topics and the 2005 named-page task. We provide further analysis of the performance of word-pair method in comparison with the Markov random field term dependence model of [2] and another generative phrase model we proposed, which is more natural on the language modeling framework [3]. 1. TMiner at Terabyte 2005 On a PC of 2GB memory, with one CPU and IDE hard disks, TMiner could index 50GB text (about 200GB HTML files) with tolerable time. But since the terabyte collection contains about 100GB pure text (110GB including anchor texts), building one single index for such a large collection would cost TMiner too much time. We built 27 indices for the 27 parts of the collection in our experiments. When retrieving, we summed the DF values of the query terms from each
THUIR at TREC 2005 Enterprise Track.
IR group of Tsinghua University participated in the expert finding task of TREC2005 enterprise track this year. We developed a novel method which is called document reorganization to solve the problem of locating expert for certain query topics. This method collects and combines related information from different media formats to organize a document which describes an expert candidate. This method proves both effective and efficient for expert finding task. Our submitted run (THUENT0505) obtains the best performance in all participants with evaluation metric MAP. The reorganized documents are also significantly smaller in size than the original corpus.
Web data cleansing for information retrieval using key resource page selection.
With the page explosion of WWW, how to cover more useful information with limited storage and computation resources becomes more and more important in web IR research. Using web page non-content feature analysis, we proposed a clustering-based method to select high quality pages from the whole page set. Although the result page set contains only 44.3% of the whole collection, it is related with more than 98% of links and covers about 90% of key information. Link property and retrieval affects are also observed and experiment results show that key resource selection method is more suitable for the job of data cleansing and the result page set outperforms the whole collection by smaller size and better retrieval performance.

MSAID multiple sequence alignment based on a measure of information discrepancy.
 
A Joint Source%2DChannel Model for Machine Transliteration.
This paper describes our system for “NEWS 2009 Machine Transliteration Shared Task ” (NEWS 2009). We only participated in the standard run, which is a direct orthographical mapping (DOP) between two languages without using any intermediate phonemic mapping. We propose a new two-step conditional random field (CRF) model for DOP machine transliteration, in which the first CRF segments a source word into chunks and the second CRF maps the chunks to a word in the target language. The two-step CRF model obtains a slightly lower top-1 accuracy when compared to a state-of-theart n-gram joint source-channel model. The combination of the CRF model with the joint source-channel leads to improvements in all the tasks. The official result of our system in the NEWS 2009 shared task confirms the effectiveness of our system; where we achieved 0.627 top-1 accuracy for Japanese transliterated to Japanese Kanji(JJ), 0.713 for English-to-Chinese(E2C) and 0.510 for English-to-
Effective Topic Distillation with Key Resource Pre%2Dselection.

An Efficient Multiple%2DConstraints QoS Routing Algorithm Based on Nonlinear Path Distance.

Representation of the Signal Transduction with Aberrance Using Ipi Calculus.

An Efficient QoS Routing Algorithm Based on Nonlinear Path Distance for Min%2DSharing Interference and Load Balancing.

How Effective Is Query Expansion for Finding Novel Information%3F

Finding %22Abstract Fields%22 of Web Pages and Query Specific Retrieval %2D THUIR at TREC 2004 Web Track.
A number of techniques have been proposed for flying through scenes by redisplaying previously rendered or digitized views. Techniques have also been proposed for interpolating between views by warping input images, using depth information or correspondences between multiple images. In this paper, we describe a simple and robust method for generating new views from arbitrary camera positions without depth information or feature matching, simply by combining and resampling the available images. The key to this technique lies in interpreting the input images as 2D slices of a 4D function - the light field. This function completely characterizes the flow of light through unobstructed space in a static scene with fixed illumination. We describe a 
THUIR at TREC 2003 Novelty%2C Robust and Web.
describing in following sections, respectively. A new IR system named TMiner has been built on which all experiments have been performed. In the system, Primary Feature Model (PFM) [1] has been proposed and combined with BM2500 term weighting [2] , which led to encouraging results. Word-pair searching has also been performed and improves system precision. Both approaches are described in robust experiments (section 2), and they were also used in web track experiments. 1. Novelty track Our research on this year&#039;s novelty track mainly focused on four aspects: (1) unsupervised relevance judgment; (2) efficient sentence redundancy computing; (3) supervised sentence classification; (4) supervised redundancy threshold learning. 1.1. Unsupervised relevance judgment The work of finding relevant information is useful for task1 and task3. Since words mismatch problem is dominant in sentence comparison, three kinds of approaches have been carried out in unsupervised relevance judgment to solve the problem as following. (1) Query Expansion (QE) using WordNet synonymy and hyponomy, and Dr Lin Dekang’s dictionary of term dependency [3];
Improved Feature Selection and Redundance Computing %2D THUIR at TREC 2004 Novelty Track.
in Novelty task of TREC. Our research on this year’s novelty track mainly focused on four aspects: (1) text feature selection and reduction; (2) improved sentence classification in finding relevant information; (3)efficient sentence redundancy computing; (4) effective result filtering. All experiments have been performed on TMiner IR system, developed by THU IR group last year. 1. Text feature selection and reduction The work of text feature selection and reduction is used as the basis of both relevant and new steps. In novelty/passage retrieval, data sparseness problem is dominant. In a sentence, different terms act as different roles. What terms take most important information for a given user query? What kinds of feature are most useful to identify the core information? This is what we try to find out in our research on text feature selection and reduction. Three kinds of approaches have been carried out: (1)Using Named Entity as significant features; (2)Using POS-tagging information for feature selection; (3)Using PCA transform for feature reduction. The former two approaches take NLP information into account. In our experiments, both NEand PCA- based approaches improve system performances, while POS-tagging information does no help. In the following, we’ll give some more detailed descriptions of NE-based feature selection and PCA-based feature reduction. 1.1 Using Named Entity as significant features The basic of NE-based approach is to recognize which phrase is Named Entity and what type of Named Entity it is. In our experiments, 34 types of Named Entities have been recognized 1, such
THUIR at TREC 2004 Genomics Track.
hoc retrieval task and Categorization task. Based on our retrieval system TMiner, our research in the Ad hoc retrieval task focuses on: (1)
Using Normal PC to Index and Retrieval Terabyte Document %2D THUIR at TREC 2004 Terabyte Track.

THUIR at TREC 2003 Novelty%2C Robust and Web.
describing in following sections, respectively. A new IR system named TMiner has been built on which all experiments have been performed. In the system, Primary Feature Model (PFM) [1] has been proposed and combined with BM2500 term weighting [2] , which led to encouraging results. Word-pair searching has also been performed and improves system precision. Both approaches are described in robust experiments (section 2), and they were also used in web track experiments. 1. Novelty track Our research on this year&#039;s novelty track mainly focused on four aspects: (1) unsupervised relevance judgment; (2) efficient sentence redundancy computing; (3) supervised sentence classification; (4) supervised redundancy threshold learning. 1.1. Unsupervised relevance judgment The work of finding relevant information is useful for task1 and task3. Since words mismatch problem is dominant in sentence comparison, three kinds of approaches have been carried out in unsupervised relevance judgment to solve the problem as following. (1) Query Expansion (QE) using WordNet synonymy and hyponomy, and Dr Lin Dekang’s dictionary of term dependency [3];
DF or IDF%3F On the Use of HTML Primary Feature Fields for Web IR.

Improving Language Model Size Reduction using Better Pruning Criteria.
Reducing language model (LM) size is a  critical issue when applying a LM to  realistic applications which have memory  constraints. In this paper, three measures  are studied for the purpose of LM  pruning. They are probability, rank, and  entropy. We evaluated the performance of  the three pruning criteria in a real  application of Chinese text input in terms  of character error rate (CER). We first  present an empirical comparison, showing  that rank performs the best in most cases.
Self%2DOrganizing Chinese and Japanese Semantic Maps.

Incremental Learning for Profile Training in Adaptive Document Filtering.
In this paper, we describe our ideas and related experiments in TREC-11 Adaptive Filtering Track. In the track we focused much on a robust way for effective profile training. We developed an incremental learning method which selects pseudo positive documents in less bias from a few initial positive training documents. We also did some experiments with newly emerged information retrieval model, language model-based retrieval mechanism, to evaluate its performance when used in adaptive filtering task. Related experiment results show the incremental learning method can be helpful for profile training, while the new language model perform not well. 1.
THU TREC 2002 Novelty Track Experiments.
This is the first time that Tsinghua University took part in TREC. In this year&#039;s novelty track, our basic idea is to find the key factor that help people find relevant and new information on a set of documents with noise. We paid attention to three points: 1. how to get full information from a short sentence; 2. how to complement hidden well-known knowledge to the sentences; 3. how to make the determination of
Software Solution to Completely Wireless Presentation.

Towards a Secure Agent Platform Based on FIPA.

TREC%2D10 Web Track Experiments at MSRA.
In TREC-10, Microsoft Research Asia (MSRA) participated in the Web track (ad hoc retrieval task and homepage finding task). The latest version of the Okapi system (Windows 2000 version) was used. We focused on the developing of content-based retrieval and linkbased retrieval, and investigated the suitable combination of the two. For content-based retrieval, we examined the problems of weighting scheme, re-weighting and pseudo-relevance feedback (PRF). Then we developed a method called collection refinement (CE) for QE. We investigated the use of two kinds of link information, link anchor and link structure. We used anchor descriptions instead of content text to build index. Furthermore, different search strategies, such as spreading activation and PageRank, have been tested. Experimental results show: (1) Okapi system is robust and effective for web retrieval. (2) In ad hoc task, content-based retrieval achieved much better performance, and the impact of anchor text can be neglected; while for homepage finding task, both anchor text and content text provide useful information contributing more on precision and recall respectively. (3) Although query expansion does not show any improvement in our web retrieval experiments, we believe that there are still potential for CE. 1.
A Novel Superscalar Architecture for Fast DCT Implementation.

Implementing Undo%2FRedo in PDF Studio Using Object%2DOriented Design Pattern.

A Faster Structured%2DTag Word%2DClassification Method

